Improving Geometric Hashing by Means of Feature Descriptors

نویسندگان

  • Federico Tombari
  • Luigi di Stefano
چکیده

Geometric Hashing is a well-known technique for object recognition. This paper proposes a novel method aimed at improving the performance of Geometric Hashing in terms of robustness toward occlusion and clutter. To this purpose, it employs feature descriptors to notably decrease the amount of false positives that generally arise under these conditions. An additional advantage of the proposed technique with respect to the original method is the reduction of the computation requirements, which becomes significant with increasing number

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image authentication using LBP-based perceptual image hashing

Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...

متن کامل

Loop Closing Detection in RGB-D SLAM Combining Appearance and Geometric Constraints

A kind of multi feature points matching algorithm fusing local geometric constraints is proposed for the purpose of quickly loop closing detection in RGB-D Simultaneous Localization and Mapping (SLAM). The visual feature is encoded with BRAND (binary robust appearance and normals descriptor), which efficiently combines appearance and geometric shape information from RGB-D images. Furthermore, t...

متن کامل

Evaluation of Hashing Methods Performance on Binary Feature Descriptors

In this paper we evaluate performance of data-dependent hashing methods on binary data. The goal is to find a hashing method that can effectively produce lower dimensional binary representation of 512-bit FREAK descriptors. A representative sample of recent unsupervised, semi-supervised and supervised hashing methods was experimentally evaluated on large datasets of labelled binary FREAK featur...

متن کامل

Locality sensitive hashing: A comparison of hash function types and querying mechanisms

It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Dramatic performance gains are obtained using approximate search schemes, such as the popular Locality-Sensitive Hashing (LSH). Several extensions have been proposed to address the limitations of this algorithm, in particular, by choosing more appropriate hash functions to better partition the vector space. All...

متن کامل

Parallel Geometric Hashing Algorithm for Protein Tertiary Structure

The amount of protein structure has become very huge nowadays, which has led to the need for improving algorithms to cope with this exponential increase. At the same time, processors have become more powerful and affordable with low price. By making use of these advantages, we can construct a powerful parallel system that will overcome the problem of exponential increase of data. This paper pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011